Champagne subdomains with unavoidable bubbles

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Unavoidable and Almost Unavoidable Sets of Words

A set of words over a finite alphabet is called an unavoidable set if every word of sufficiently long length must contain some word from this set as a subword. Motivated by a theorem from automata theory, we introduce the notion of an almost unavoidable set and prove certain asymptotic estimates for the size of almost unavoidable sets of uniform length.

متن کامل

Graphs with unavoidable subgraphs with large degrees

Let `,(n, m) denote the class of simple graphs on n vertices and m edges and let G C `6(n, m) . There are many results in graph theory giving conditions under which G contains certain types of subgraphs, such as cycles of given lengths, complete graphs, etc . For example, Turan's theorem gives a sufficient condition for G to contain a K,,„ in terms of the number of edges in G . In this paper we...

متن کامل

Unavoidable patterns

Let Fk denote the family of 2-edge-colored complete graphs on 2k vertices in which one color forms either a clique of order k or two disjoint cliques of order k. Bollobás conjectured that for every 2 > 0 and positive integer k there is an n(k, 2) such that every 2-edge-coloring of the complete graph of order n ≥ n(k, 2) which has at least 2n2 ) edges in each color contains a member of Fk. This ...

متن کامل

Unavoidable arrays

An n × n array is avoidable if for each set of n symbols there is a Latin square on these symbols which differs from the array in every cell. We characterise all unavoidable square arrays with at most 2 symbols, and all unavoidable arrays of order at most 4. We also identify a number of general families of unavoidable arrays, which we conjecture to be a complete account of unavoidable arrays. N...

متن کامل

Unavoidable tournaments

A basic result in Ramsey theory states that any tournament contains a “large” transitive subgraph. Since transitive tournaments contain only transitive subgraphs, it is natural to ask which subgraphs must appear in any large tournament that is “far” from being transitive. One result of this type was obtained by Fox and Sudakov who characterized the tournaments that appear in any tournament that...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Advances in Mathematics

سال: 2013

ISSN: 0001-8708

DOI: 10.1016/j.aim.2013.05.011